Segmenting an image via a graph

ABSTRACT

A method is described for segmenting an image of pixels into a number of fields. A graph is constructed for representing the image. First, separating elements are constructed that are oblong areas of adjacent pixels having a background property indicative of a background of the image. Then vertices of the graph are defined based on intersections of separating elements that are substantially oriented in different separation directions, in particular horizontal and vertical direction, and edges of the graph are defined between the vertices corresponding to the separating elements. Finally, the edges of the graph are interpreted as lines that separate the fields.

[0001] The present application claims, under 35 U.S.C. § 119, the priority benefit of European Patent Application No. 02079880.7 filed Nov. 22, 2002, the entire contents of which are herein fully incorporated by reference.

BACKGROUND OF THE INVENTION

[0002] 1. Field of the Invention

[0003] The invention relates to a method of segmenting a composite image of pixels into a number of fields corresponding to lay-out elements of the image, the pixels having a value representing the intensity and/or color of a picture element. The invention further relates to a device implementing the method, which device comprises an input unit for inputting an image, and a processing unit.

[0004] 2. Discussion of Background Art

[0005] Several methods for segmenting a composite image, such as a document including text and figures, to identify fields corresponding to layout elements, are known in the art, and a common approach is based on processing the background. The image is represented by pixels that have a value representing the intensity and/or color of a picture element. This value is classified as background (usually white) or foreground (usually black, being printed space). The white background space that surrounds the printed regions on a page is analyzed.

[0006] A method for page segmentation is known from the article “Image Segmentation by Shape-Directed Covers” by H. S. Baird et. al. in Proceedings 10^(th) International Conference on Pattern Recognition, Atlantic City, N.Y., June 1990, pp. 820-825. According to this method, in an image to be analyzed, a set of maximal rectangles of background pixels is constructed, a maximal rectangle being a rectangle that cannot be enlarged without including a foreground pixel. Segmentation of the image into information-bearing fields, i.e. text columns, is achieved by covering the total image with a reduced set of the maximal rectangles. The remaining ‘uncovered’ area is considered foreground and may be used for further analysis. A problem of this method is that the fields are defined as areas in the pixel domain, which does not allow computationally efficient further processing.

[0007] U.S. Pat. No. 6,470,095 discloses a method of page segmentation in which text areas are first preprocessed in a number of processing steps, to construct closed areas, called “enclosure blobs”, of black pixels. In the remaining white spaces, bands of white space having a maximal length are constructed by suppressing bands of white space adjacent to a longer band. The final bands of white space, horizontal and vertical are then replaced by their midlines. Finally, the junctions between horizontal and vertical midlines are detected, and loose ends are cut off. The remaining midline sections are used as delimiters of text fields. This known method involves a large number of processing steps and may in some instances give inaccurate results, when white spaces connect, but their midlines do not.

[0008] Another method for page segmentation is known from the article “Flexible page segmentation using the background” by A. Antonacopoulos and R. T Ritchings in Proceedings 12^(th) International Conference on Pattern Recognition, Jerusalem, Israel, October 9-12, IEEE-CS Press, 1994, vol 2, pp. 339-344. According to this method, the background white space is covered with tiles, i.e. non-overlapping areas of background pixels.

[0009] The contour of a foreground field in the image is identified by tracing along the white tiles that encircle it, such that the inner borders of the tiles constitute the border of a field for further analysis. A problem of this method is that the borders of the fields are represented by a complex description which frustrates an efficient further analysis.

SUMMARY OF THE INVENTION

[0010] It is an object of the invention to provide a method and device for segmenting an image which is more efficient, and in particular delivers a simple description of the segmented image that can easily be used in further processing steps.

[0011] According to a first aspect of the invention, a method of segmenting an image of pixels into a number of fields, includes constructing separating elements corresponding to rectangular areas of adjacent pixels having a background property indicative of a background of the image; constructing a graph representing the lay-out structure of the image by defining vertices of the graph on the basis of intersections of separating elements that are substantially oriented in predetermined separation directions, in particular horizontal and vertical direction, and defining edges of the graph between the nodes corresponding to the field separators; and defining field separators corresponding to the edges of the graph.

[0012] According to a second aspect of the invention, a device for segmenting an image of pixels into a number of fields corresponding to lay-out elements of the image, the pixels having a value representing the intensity and/or color of a picture element, includes: an input unit for inputting an image; and a processing unit for constructing a graph representing the lay-out structure of the image by constructing separating elements corresponding to rectangular areas of adjacent pixels having a background property indicative of a background of the image, defining vertices of the graph based on intersections of separating elements that are substantially oriented in different separation directions, in particular horizontal and vertical direction, and defining edges of the graph between the vertices corresponding to the separating elements.

[0013] According to a third aspect of the invention, a computer program product for performing the method of the present invention is provided.

[0014] The advantage of constructing the graph is that the edges provide a compact and efficient representation of the borders of the fields. Further analysis of the fields based on the graph is computationally efficient.

[0015] The invention is also based on the following recognition. A graph representation has been proposed but rejected as being too complex in segmentation in the article by A. Antonacopoulos as described above. The inventors have seen that the graph of Antonacopoulos is not representing the fields at all, but only provides a representation of the background tiles in the image and their adjacency. The graph constructed according to the invention, however, directly covers the fields based on the structure of the background, and therefore provides a representation on a high level of the fields in the layout of the image.

[0016] It is noted that a graph representation is used for representing the layout of a document by Y. Belaid et al., “Item searching in forms: application to french tax form”, Document analysis and recognition, 1995, Proceedings of the third international conference on Montreal, Que., Canada, 14-16 Aug. 1995, Los Alamitos, Calif., USA, IEEE Comput. Soc., US, 14 Aug. 1995 (1995-08-14), pp. 744-747, XP010231002, ISBN: 0-8186-7128-9. However, according to this disclosure, a graph is constructed from existing black lines in the document, that frame fields that may or may not contain text. Thus, the use of text areas and white spaces in the document image is not made, and this known method would be useless in documents not having black frame lines.

[0017] In an embodiment, the step of defining vertices comprises constructing subsets of separating elements that are substantially oriented in the predetermined separation directions, and determining the intersections between pairs of separating elements from both subsets. This has the advantage that the vertices in the graph are constructed in an efficient way.

[0018] In a further embodiment, the method comprises constructing a set of maximal rectangles, a maximal rectangle being a rectangular part of the image in one of the separation directions, that has the maximum possible area without including a pixel not having the background property indicative of a background of the image, and constructing the separating elements in a cleaning step wherein at least one pair of overlapping maximal rectangles in the set is replaced by an informative rectangle that is a rectangular part of an area combining the areas of the pair, which rectangular part has the maximum possible length in the relevant separation direction.

[0019] This has the effect that separating elements that are long and narrow along a separation direction are constructed efficiently. The advantage is that separating elements most informative for separating fields are constructed and fields enclosed by the separating elements are detected easily. Although initially a large number of maximal rectangles are found the cleaning step efficiently reduces said number so that a computationally efficient procedure for construction of the separating elements is possible.

[0020] In an embodiment of the method, prior to constructing the maximal rectangles, the image is filtered by detecting foreground separator elements that are objects in the foreground of the image having a pattern of pixel values deviating from said background property, in particular black lines or dashed or dotted lines, and by replacing pixels of the detected foreground separators by pixels having the background property. The effect of replacing foreground separators by the background color is that larger and more relevant areas of background are formed. The advantage is that larger background areas are present and without additional computational steps. This results in larger maximal rectangles, which improves the quality of the resulting segmentation.

[0021] These and other objects of the present application will become more readily apparent from the detailed description given hereinafter. However, it should be understood that the detailed description and specific examples, while indicating preferred embodiments of the invention, are given by way of illustration only, since various changes and modifications within the spirit and scope of the invention will become apparent to those skilled in the art from this detailed description.

BRIEF DESCRIPTION OF THE DRAWINGS

[0022] These and other aspects of the invention will be apparent from and elucidated further with reference to the embodiments described by way of example in the following description and with reference to the accompanying drawings, in which

[0023]FIG. 1 shows an overview of an exemplary segmentation method usable in the present invention,

[0024]FIG. 2 shows a part of a sample Japanese newspaper,

[0025]FIG. 3 shows the merging of objects along a single direction,

[0026]FIG. 4 shows segmentation and two directional merging of objects according to an embodiment of the present invention,

[0027]FIG. 5 shows construction of a maximal rectangle from white runs,

[0028]FIG. 6 shows construction of maximal white rectangles,

[0029]FIG. 7 shows cleaning of overlapping maximal white rectangles,

[0030]FIG. 8 shows a graph on a newspaper page,

[0031]FIG. 9 shows two types of intersection of maximal rectangles, and

[0032]FIG. 10 shows a device for segmenting a picture according to an embodiment of the present invention.

[0033] The figures are diagrammatic and not drawn to scale. In the figures, elements which correspond to elements already described have the same reference numerals.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0034]FIG. 1 shows an overview of an exemplary segmentation method showing three basic steps from known segmentation systems. Referring to FIG. 1, an input image 11 is processed in a CCA (Connected Component Analysis) module 14 that analyses the pixels of the image using Connected Component Analysis. First an original picture that may be a black-and-white, grayscale or coloured document, e.g. a newspaper page, is scanned, preferably in gray scale. Grayscale scanned pictures are halftoned for assigning a foreground value (e.g. black) or a background value (e.g. white) to each pixel. The CCA module 14 finds foreground elements in the image by detecting connected components (CC) of adjacent pixels having similar properties. An example of these first steps in the segmentation process are for instance described in U.S. Pat. No. 5,856,877.

[0035] The CCA module 14 produces as output CC Objects 12 that are connected components of connected foreground pixels. An LA (Layout Objects) module 15 receives the CC Objects 12 as input and produces Layout Objects 13 by merging and grouping the CC Objects 12 to form larger layout objects 13 such as text lines and text blocks. During this phase, heuristics are used to group layout elements to form larger layout elements. This is a logical step in a regular bottom-up procedure. An AF (Article Formation) module 16 then receives the Layout Objects 13 as input and produces Articles 17 as output by article formation. In this module 16, several layout objects that constitute a larger entity are grouped together. The larger entity is assembled using layout rules that apply to the original picture. For example in a newspaper page, the AF module 16 groups the text blocks and graphical elements like pictures to form the separate articles, according to the layout rules of that specific newspaper style. Knowledge of the layout type of the image, e.g. Western type magazine, Scientific text or Japanese article layouts, can be used for a rule-based approach of article formation resulting in an improved grouping of text blocks.

[0036] According to the invention, additional steps are added to the segmentation as described below. These steps relate to segmentation of the image into fields before detecting elements within a field, i.e. before forming layout objects that are constituted by smaller, separated but interrelated items. FIG. 2 shows a sample Japanese newspaper. Such newspapers have a specific layout that includes text lines in both the horizontal reading direction 22 and the vertical reading direction 21. The problem for a traditional bottom-up grouping process of detected connected components is that it is not known in which direction the grouping should proceed. Hence the segmentation is augmented by an additional step of processing the background for detecting the fields in the page. Subsequently the reading direction for each field of the Japanese paper is detected before the grouping of characters is performed.

[0037] In an embodiment of the present method, separator elements, e.g. black lines 23 for separating columns are detected and converted into background elements. With this option, it is possible to separate large elements of black lines 23 containing vertical and horizontal lines that are actually connected into different separator elements. In Japanese newspapers, lines are very important objects for separating fields in the layout. It is required that these objects are recognized as lines along separation directions. Without this option, these objects would be classified as graphics. Using the option of the present invention, the lines can be treated advantageously as separator elements in the different orientations separately for each separation direction.

[0038]FIG. 3 shows a basic method of merging objects in a single direction. This figure depicts the basic function of the LA module 15 for finding the layout objects oriented in a known direction, such as text blocks for the situation that the reading order is known. Referring to FIG. 3, connected components (CC objects) 12 are processed in a first, analysis step 31 by statistical analysis resulting in computed thresholds 32. In a second, classification step 33 the CC-classification is corrected resulting in the corrected connected components 34, which are processed in a third, merging step 35 to join characters to text lines, resulting in text lines and other objects 36. In a fourth, text merging step 37 the text lines are joined to text blocks 38 (and possibly other graphical objects). According to the requirements for Japanese news papers, the traditional joining of objects must be along at least two reading directions, and the basic method described above must be improved therefor.

[0039]FIG. 4 shows segmentation and two directional joining of objects according to an embodiment of the present invention. In this embodiment, new additional steps have been added compared to the single directional processing in FIG. 3. Referring to FIG. 4, in a first (pre-) processing step, a graph 41 of the image is constructed. The construction of the graph by finding field separators is described below. In the graph, fields are detected in a field detection step 42 by finding areas that are enclosed by edges of the graph. The relevant areas are classified as fields containing text blocks 47. In the text block 47 (using the connected components 43 or corrected connected components 34 that are in the text block area), the reading order 45 is determined in a step 44. The reading direction detection is based upon the document spectrum. Using the fields of the text blocks 47, the contained connected components 43 and the reading order 45 as input, the Line Build step 46 joins the characters to lines as required along the direction found.

[0040] Now the constructing of the graph 41 is described. A graph-representation of a document is created using the background of a scan. Pixels in the scan are classified as background (usually white) or foreground (usually black). Because only large areas of white provide information on fields, small noise objects are removed, e.g. by down-sampling the image. The down-sampled image may further be de-speckled to remove single foreground (black) pixels.

[0041] The next task is to extract the important white areas. The first step of this task is to detect so-called white runs, one pixel high areas of adjacent background pixels. White runs that are shorter than a predetermined minimal length are excluded from the processing.

[0042]FIG. 5 shows, as an example, four horizontal runs 51 of white pixels, that are adjacent to each other in the vertical direction. As shown in FIG. 5, foreground area 53 is assumed to have foreground pixels directly surrounding the white runs 51. A “maximal white rectangle” is defined as the largest rectangular area that can be constructed from the adjacent white runs 51, hence a rectangular white area that can not be extended without including black (foreground) pixels. A maximal white rectangle 52 is shown based on the four white runs 51 having a length as indicated by the vertical dotted lines and a width of 4 pixels. When a white rectangle can not be extended, it has a so-called maximal separating power. Such a rectangle is not a smaller part of a more significant white area. Hence, in this example, the rectangle 52 is the only possible maximal rectangle of width 4. Further rectangles can be constructed of width 3 or 2. A further example is shown in FIG. 6.

[0043] The construction of white rectangles is done separately in different separation directions, e.g. horizontal and vertical white rectangles. Vertical white rectangles are detected by rotating the image, and detecting horizontal white runs for the rotated image. It is noted that depending on the type of image or application also, other separation directions may be selected such as diagonal.

[0044] An algorithm for constructing maximal white rectangles according to the present invention is as follows. The input of the algorithm includes all horizontal one pixel high white runs (WR) detected from a given image. Each white run is represented as a rectangle characterized by a set of coordinates ((x₁,y₁),(x₂,y₂)), where x₁ and y₁ are coordinates of the top left corner of the rectangle and x₂ and y₂ are the coordinates of the bottom right corner of the rectangle. Each white run present in the active ordered object INPUT LIST is tested on an extension possibility. The extension possibility is formulated in the condition whether a given WR, labeled by p, can produce a maximal white rectangle (MWR) or not. If the extension possibility is FALSE, then p is already a maximal one, and p is deleted from the active INPUT LIST and written to the active. RESULT LIST. If the extension possibility is TRUE, then the test for extension is repeated until all MWRs initiated by p have been constructed. Then p is deleted from the INPUT LIST and all MWRs obtained from p are written to the active RESULT LIST. When all white rectangles from the INPUT LIST have been processed, the RESULT LIST will contain all MWRs. To increase the efficiency of this algorithm, a sort on the y value is applied to the INPUT LIST. First, the algorithm is applied for horizontal WRs, i.e. for white runs with width larger than height. And after a 90° turn of the image it can be applied to vertical WRs.

[0045] In an embodiment, the algorithm for constructing the maximal rectangles is as follows. The rectangle data are stored as a linked list, with at least the coordinates of the rectangle vertices contained in it. The INPUT and RESULT LISTs are stored as a linked list too, with at least three elements, such as the number of white rectangles, and pointers on the first and the last element in the linked list. The following steps are executed: Activate INPUT LIST; Initiate RESULT LIST; and Initiate BUFFER for temporary coordinates of the selected rectangle. Start from the first white rectangle labeled by p₁, out of the active ordered INPUT LIST. The next white rectangle on the list is labeled by p₂. For each white rectangle on the INPUT LIST, examine whether or not if p₁ has extension possibility. For the active white rectangle p₁, find the first one labeled by p_(nj), j=1, . . . , l, on the active ordered INPUT LIST, which satisfies

y ₂(p ₁ )=y ₁(p _(nj)),

x ₁(p _(nj))≦x ₂(p ₁), and

x ₂(p _(nj))≧x ₁(p ₁).

[0046] This search results in the set {p_(n1), p_(n2), . . . , p_(nl)}. Only if the set {p_(n1), p_(n2), . . . , p_(nl)} is not empty, p₁ is said to have extension possibility.

[0047] If p₁ does not have an extension possibility, then p₁ is a maximal white rectangle. Write p₁ to the RESULT LIST, and remove p1 from the INPUT LIST, and proceed with p₂. If p₁ is extendible, then apply the extension procedure to p₁. Proceed with p₂. We note here, that p₁ can have an extension possibility while being maximal itself.

[0048] The Extension Procedure is as follows. Suppose p₁ has an extension possibility, then there is the set {p_(n1), p_(n2), . . . , p_(nl)}. The extension procedure is applied to each element of {p_(n1), p_(n2), . . . , p_(nl)} consistently. For the white rectangle p₁ which is extendible with rectangle p_(nj), j=1, . . . , l, construct a new rectangle p_(1,nj) with coordinates:

x ₁(p _(1,nj))=max {x ₁(p ₁), x ₁(p _(nj))},

x ₂(p _(1,nj))=min {x ₂(p ₁), x ₂(p _(nj))},

y ₁(p _(1,nj))=y ₁(p ₁), and

y ₂(p _(1,nj))=y ₂(p _(nj)).

[0049] Write the coordinates of p_(1,nj), j=1, . . . , l to the “coordinates” buffer. Repeat the test on extension possibility now for p_(1,nj). If the test is TRUE, p_(1,nj) is maximal. Write p_(1,nj) to the RESULT LIST, otherwise, extend p_(1,nj).

[0050] Before applying the extension procedure to p_(1,nj), we check p₁ and p_(nj) for absorption effect. The test of p₁ and p_(nj) for absorption effect with _(p1,nj) is as follows. By absorption effect we mean the situation in which p₁ (p_(nj)) or both is (are) completely contained in p_(1,nj). In coordinates this means:

x ₁(p _(1,nj))≦x ₁(p _(k)),

x ₂(p _(1,nj))≧x₂(p _(k)),

[0051] where k=1, nj, j=1, . . . , l.

[0052] If the condition is TRUE for p₁, then p₁ is absorbed by p_(1,nj). Remove p₁ from the INPUT LIST. If the condition is TRUE for p_(nj), then p_(nj) is absorbed by p_(1,nj). Remove p_(nj) from the INPUT LIST.

[0053] The algorithm assumes that the rectangle is wider than it is high, and thus the rectangles are primarily horizontal. To construct MWRs in the vertical direction, the original binary image is rotated by 90° clockwise. The algorithm mentioned above is repeated for the rotated image. As a result, all vertical MWRs for the original image are constructed.

[0054]FIG. 6 shows a construction of maximal white rectangles according to an embodiment of the present invention. The pixel coordinates are displayed along a horizontal x axis and a vertical y axis. Four white runs 61 are shown left in FIG. 6. The white runs (WR) are described as rectangles with the coordinates of their upper and bottom corners correspondingly:

[0055] WR₁: ((10,1),(50,2)),

[0056] WR₂: ((10,2),(50,3)),

[0057] WR₃: ((5,3),(30,4)), and

[0058] WR₄: ((40,3),(60,4)).

[0059] All maximal white rectangles from these white runs are constructed. The resulting five maximal white rectangles (MWR) are shown in the right part of FIG. 6 as indicated by 62, 63, 64, 65 and 66. The five MWR shown are the complete set of MWR for the WR given in the left part of FIG. 6. A construction algorithm for constructing the maximal white rectangles according to the present invention is as follows.

[0060] As an example, let the INPUT LIST contain the four white runs 61. The first element from the INPUT LIST is WR₁((10,1),(50,2)). Label WR₁ as p₁. Examine p₁ on the extension possibility as described above. The first candidate for extension is WR₂((10,2),(50,3)). Label WR₂ as p_(n1). Extend p₁ with p_(n1) according to the formula for extension above, which gives a new rectangle p_(1,n1) with the coordinates ((10,1),(50,3)). Test p₁ and p_(n1) on the absorption effect with p_(1,n1). As follows from absorption test, both p₁ and p_(n1) are absorbed by p_(1,n1). Therefore, delete p₁ and p_(n1) from the INPUT LIST. Proceed with p_(1,n1). Test p_(1,n1) on the extension possibility, which gives the first candidate WR₃ ((5,3),(30,4)). Label WR₃ as p_(t1). Extend p_(1,n1) with p_(t1) according to the extension formula. As a result, we obtain a new rectangle p_((1,n1),t1) with the coordinates ((10,1),(30,4)). Test p_(1,n1) with p_(t1) on the absorption effect with p_((1,n1),t1). The test fails.

[0061] Repeat the test on extension possibility for p_((1,n1),t1) The test fails, i.e. p_((1,n1),t1) has no extension possibility. It means that p_((1,n1),t1) is maximal. Write p_((1,n1),t1) with the coordinates ((10,1),(30,4)) to the RESULT LIST.

[0062] Proceed again with p_(1,n1) and test it on extension possibility. The second candidate WR₄ ((40,3),(60,4)) is found. Label WR₄ as p_(t2). Extend p_(1,n1) with p_(t2) according to the extension formula. As a result, we obtain a new rectangle p_((1,n1),t2) with the coordinates ((40,1),(50,4)).

[0063] Test p_(1,n1) with p_(t2) on the absorption effect with p_((1,n1),t2). The test fails, i.e. no absorption. Repeat test on extension possibility for p_((1,n1),t2) and the test fails, i.e. p_((1,n1),t2) has no extension possibility. It means that p_((1,n1),t2) is maximal. Write p_((1,n1),t2) with the coordinates ((40,1),(50,4)) to the RESULT LIST.

[0064] Test p_(1,n1) again on extension possibility. The test fails and p_(1,n1) is maximal. Write p_(1,n1) with the coordinates ((10,1),(50,3)) to the RESULT LIST.

[0065] Return to the INPUT LIST. The INPUT LIST on this stage contains two write runs, i.e. WR₃: ((5,3),(30,4)), WR₄: ((40,3),(60,4)). Start from WR₃, and label it as p₂. Repeat test on extension possibility for p₂. The test fails, 56 p₂ is maximal. Write p₂ with the coordinates ((5,3),(30,4)) to the RESULT LIST. Remove p₂ from the INPUT LIST.

[0066] Proceed with WR₄ and label it as p₃. Test on extension possibility for p₃ gives us that p₃ is maximal. Write p₃ with the coordinates ((40,3),(60,4)) to the RESULT LIST. Remove p₃ from the INPUT LIST. Finally, the RESULT LIST contains five maximal white rectangles, i.e. MWR₁: ((10,1),(50,3)) indicated in FIG. 6 as 64, MWR₂: ((10,1),(30,4)) indicated as 62, MWR₃: ((40,1),(50,4)) indicated as 63, and MWR₄: ((5,3),(30,4)) as 65, MWR₅: ((40,3),(60,4)) as 66.

[0067]FIG. 7 shows a next step in the method according to the invention, namely a cleaning step of overlapping maximal white rectangles. In the cleaning step, plural overlapping maximal white rectangles are consolidated into a single so-called “Informative Maximal Rectangle” (IWR) that combines the most relevant properties of the original maximal white rectangles, as discussed below in detail.

[0068] The cleaning step may further include steps like checking on size and spatial relation. The upper part of FIG. 7 shows, as an example, two maximal white rectangles MWR1 and MWR2. The pair is consolidated into a single Informative White Rectangle IWR in the cleaning step as shown in the lower part of FIG. 7. The process of detecting an overlap and consolidating is repeated until no relevant pairs can be formed anymore. A criterion for forming pairs may be the size of the overlap area.

[0069] Further, the cleaning step may include removing thin or short rectangles or rectangles that have an aspect ratio below a certain predefined value. The criteria for removing are based on the type of image, e.g. a width below a predefined number of pixels indicates a separator of text lines and is not relevant for separating fields, and a length below a certain value is not relevant in view of the expected sizes of the fields.

[0070] An algorithm for the cleaning step according to the present invention is as follows. The start of the cleaning procedure is the whole set of MWRs constructed as described above with reference to FIGS. 5 and 6. The cleaning procedure is applied to discard non-informative MWRs. For this reason a measure of non-informativeness is defined. For example, a long MWR is more informative than a short one. A low aspect ratio indicates a more or less square rectangle that is less informative. Further, extremely thin rectangles, which for instance separate two text lines, must be excluded. First, all MWRs are classified as being horizontal, vertical or square by computing the ratio between their heights and widths. Square MWRs are deleted because of their non-informativeness. For the remaining horizontal and vertical MWRs, the cleaning technique is applied which includes three steps:

[0071] Each MWR with a length or width below a given value is deleted.

[0072] Each MWR with aspect ratio (AR), defined as the ratio of the longer side length divided by the shorter side length, below a given value is deleted.

[0073] For each pair of overlapping horizontal (or vertical) MWR₁ ((x₁,y₁),(x₂,y₂)) and horizontal (or vertical) MWR₂ ((a₁,b₁),(a₂,b₂)), an informative white rectangle IWR is constructed with the following coordinates:

[0074] (a) Horizontal overlap:

[0075] x₁=min {x₁, a₁},

[0076] y₁=max {y₁, b₁},

[0077] x₂=max {x₂, a₂},

[0078] y₂=min {y₂, b₂}.

[0079] (b) Vertical overlap:

[0080] x′₁=max {x₁, a₁},

[0081] y′₁=min {y₁, b₁},

[0082] x′₂=min {x₂, a₂},

[0083] y′₂=max {y₂, b₂}.

[0084] This process is repeated for all pairs of overlapping MWRs. The set of MWRs now comprises Informative White Rectangles IWRs. These IWRs form the starting point for an algorithm for segmentation of the image into fields corresponding to the lay-out elements. The IWRs are potential field separators and are therefore called “separating elements”. Using the IWRs, the algorithm constructs a graph for further processing into a geographical description of the image.

[0085]FIG. 8 shows such a graph on a newspaper page. The picture in FIG. 8 shows a down-sampled digital image 80 of a newspaper page. The original text is visible in black in a down-sampled version corresponding to FIG. 2. The informative rectangles IWR constituting separating elements are shown in gray. For the construction of the graph, intersections of separating elements constituted by horizontal and vertical white IWRs are determined. The intersection point of two IWRs is indicated by a small black square representing a vertex or vertex 81 in the graph. Edges 82 that represent lines that separate the fields in the page are constructed by connecting pairs of vertices 81 via “field separators”. The edges 82 of the graph are shown in white. The distance between the two vertices of an edge, i.e. the length, is assigned as weight to the edge for further processing. In an alternative embodiment a different parameter is used for assigning the weight, e.g. the colour of the pixels. An algorithm for constructing the graph is as follows.

[0086] At the beginning, the following notation and definitions for IWRs is given. Let R={r₁, . . . , r_(m)} be the non-empty and finite set of all IWRs obtained from a given image I, where each IWR is specified by its x- and y- coordinates of top left corner and bottom right corner ((x₁ ^((τ)), y₁ ^((τ))), (x₂ ^((τ)), y₂ ^((τ)))), τ=1, 2, . . . , m respectively. Each rectangle r_(τ) is classified as horizontal, vertical or square based on the ratio of its height and width. H={h₁, . . . , h_(l)}, V={v₁, . . . , v_(k)}, and S={s₁, . . . , s_(d)} denote the subsets of horizontal, vertical and square IWRs, respectively, such that

H∪V∪S=R

[0087] and

m=l+k+d,

[0088] and

H∩V=Ø, V∩S=Ø, H∩S=Ø

[0089] where it is assumed that

H≠Ø, V≠Ø.

[0090] Further the contents of S are ignored and only the subsets H and V are used. This is based on the consideration that in most cases, white spaces that form the border of text or non-text blocks are oblong vertical or horizontal areas. Let h be part of H with coordinates ((x₁,y₁),(x₂,y₂)) and v in V with coordinates ((a₁,b₁),(a₂,b₂)). Then h and v have overlap if $\left\{ {\quad\begin{matrix} {x_{1} \leq a_{2}} \\ {y_{1} \leq b_{2}} \\ {x_{2} \geq a_{1}} \\ {y_{2} \geq b_{1}} \end{matrix}} \right.$

[0091] By the intersection point of h and v in case of overlap, we take the unique point P defined by the coordinates: $\left\{ {\quad\begin{matrix} {{x_{P} = {\frac{1}{2}\left( {{\max \left\{ {x_{1},a_{1}} \right\}} + {\min \left\{ {x_{2},a_{2}} \right\}}} \right)}},} \\ {y_{P} = {\frac{1}{2}\left( {{\max \left\{ {y_{1},b_{1}} \right\}} + {\min \left\{ {y_{2},b_{2}} \right\}}} \right)}} \end{matrix}} \right.$

[0092] For IWRs, only two from all possible types of overlap occur, namely overlap resulting in a rectangle and overlap resulting in a point. Line overlap cannot occur, because this would be in contradiction with the concept of the MWRs.

[0093]FIG. 9 shows two types of intersection of maximal rectangles. For constructing the graph, the intersection points of vertical and horizontal informative maximal rectangles are determined to find the position of vertices of the graph, i.e. to determine the exact coordinates of the vertices. The left part of FIG. 9 shows a first type of intersection of vertical IWR v and a horizontal IWR h, which results in a rectangular area 88 with a center of intersection point P. The right part of FIG. 9 shows a second type of intersection of a vertical IWR v and a horizontal IWR h, that results in a single intersection point 89 with a center of intersection at P′.

[0094] An algorithm for constructing the graph based on the intersection points is as follows.

[0095] P={p_(1, . . . ,) p_(N)} denotes the set of all intersection points of vertical IWRs and horizontal IWRs where each p in P is specified by its x- and y- coordinates (x_(p), y_(p)), where p=1, . . . , N. Let the set P be found, and G=(X,A) an undirected graph having correspondence to P. The graph G=(X,A) includes a finite number of vertices X which are directly related to the intersection points and a finite number of edges A which describe the relation between intersection points. Mathematically this is expressed as

G(P)=(X(P), A(P×P)),

P: H×V→{x _(P) , y _(P)},

[0096] where

X≡{1, . . . , N} and

A=({1, . . . , N}×{1, . . . , N})

[0097] with ${A\left( {i,j} \right)} = \left\{ \begin{matrix} {\infty,{{if}\quad i\quad {and}\quad j\quad {are}\quad {not}\quad 4\text{-}{chain}\quad {connected}},} \\ {d_{ij},{{if}\quad i\quad {and}\quad j\quad {are}\quad 4\text{-}{chain}\quad {connected}}} \end{matrix} \right.$

[0098] where d_(ij) indicates the Euclidean distance between points i and j, and where 4-chain connected means that the vertices of a rectangular block are connected in four possible directions of movement. In the above, two points i and j are 4-chain connected if they can be reached by walking around with the aid of 4-connected chain codes with min d_(ij) in one direction.

[0099] The graph as constructed may now be further processed for classifying the areas within the graph as text blocks or a similar classification depending on the type of picture. In an embodiment, the graph is augmented by including foreground separators, e.g. black lines or patterned lines such as dashed/dotted lines, in the analysis. Also, edges of photos or graphic objects which are detected can be included in the analysis.

[0100] The present segmenting method may also include a step of removing foreground separators. In this step, first, foreground separators are recognized and reconstructed as single objects. The components that constitute a patterned line are connected by analyzing element heuristics, spatial relation heuristics and line heuristics, i.e. building a combined element in a direction and detecting if it classifies as a line. A further method for reconstructing a solid line from a patterned line is down-sampling and/or using the Run Length Smoothing Algorithm (RLSA) as described by K. Y. Wong, R. G. Casey, F. M. Wahl in “Document analysis system”, IBM J. Res. Dev 26 (1982) 647-656. After detecting the foreground separators, they are replaced by background pixels. The effect is that larger maximal white rectangles can be constructed, or supporting any other suitable method using the background pixel property for finding background separators.

[0101]FIG. 10 shows a device for segmenting a picture according to an embodiment of the present invention. The various methods of the present invention are implementable using the device of FIG. 10 or other suitable devices. Referring to FIG. 10, the device has an input unit 91 for entering a digital image. The input unit 91 may comprise a scanning unit for scanning an image from physical documents such as an electro-optical scanner, and/or a digital communication unit for receiving the image from a network like internet, and/or a playback unit for retrieving digital information from a record carrier like an optical disc drive. The input unit 91 is coupled to a processing unit 94, which cooperates with a memory unit 92. The processing unit 94 may comprise a general purpose computer central processing unit (CPU) and supporting circuits and operates using software for performing the segmentation as described above. The processing unit 94 may include a user interface 95 provided with control means such as a keyboard, a mouse device or operator buttons. The output of the processing unit 94 is coupled to a display unit 93. The display unit 93 may comprise a display screen, a printing unit for outputting a processed image on paper or other medium, and/or a recording unit for storing the segmented image on a record carrier like a magnetic tape or optical disk.

[0102] The processing steps of the present invention are implementable using existing computer programming language. Such computer program(s) may be stored in memories such as RAM, ROM, PROM, etc. associated with computers. Alternatively, such computer program(s) may be stored in a different storage medium such as a magnetic disc, optical disc, magneto-optical disc, etc. Such computer program(s) may also take the form of a signal propagating across the Internet, extranet, intranet or other network and arriving at the destination device for storage and implementation. The computer programs are readable using a known computer or computer-based device.

[0103] Although the invention has been mainly explained by embodiments using a Japanese newspaper page as the digital image to be segmented, the invention is also suitable for any digital representation of any text or image having a layout in fields on a background, such as electrical circuits in layout images for IC design or streets and buildings on city maps. It is noted that in the present document, the use of the verb ‘comprise’ and its conjugations does not exclude the presence of other elements or steps that are not listed and the word ‘a’ or ‘an’ preceding an element does not exclude the presence of a plurality of such elements, that any reference signs do not limit the scope of the claims, that the invention and every unit or means mentioned may be implemented by suitable hardware and/or software and that several ‘means’ or ‘units’ may be represented by the same item. Further, the scope of the invention is not limited to the embodiments, and the invention lies in each and every novel feature or combination of features described above. 

1. A method of segmenting a composite image of pixels into a number of fields corresponding to lay-out elements of the image, the pixels having a value representing the intensity and/or color of a picture element, the method comprising: constructing separating elements corresponding to rectangular areas of adjacent pixels of the image having a background property indicative of a background of the image; and constructing a graph representing the lay-out elements of the image by defining vertices of the graph on the basis of intersections of separating elements that are substantially oriented in predetermined separation directions, defining edges of the graph between the vertices corresponding to the separating elements, and defining field separators corresponding to the edges of the graph.
 2. The method as claimed in claim 1, wherein the step of defining vertices comprises: constructing subsets of the separating elements that are substantially oriented in the predetermined separation directions, and determining the intersections between pairs of separating elements from the subsets.
 3. The method as claimed in claim 2, wherein the step of determining the intersections comprises: determining an area of overlap of the separating elements from the subsets, and locating the vertex at the center of the area of overlap.
 4. The method as claimed in claim 1, wherein the graph constructing step comprises: assigning a weight to the edges indicating an Euclidean distance between the vertices.
 5. The method as claimed in claim 1, further comprising: constructing a set of maximal rectangles, a maximal rectangle being a rectangular part of the image in one of the separation directions, that has the maximum possible area without including a pixel not having the background property indicative of a background of the image; and constructing the separating elements in a cleaning step wherein at least one pair of overlapping maximal rectangles in the set is replaced by an informative rectangle that is a rectangular part of an area combining the areas of the pair, the rectangular part having the maximum possible length in the relevant separation direction.
 6. The method as claimed in claim 5, wherein the cleaning step further comprises at least one of the following: deleting a maximal rectangle having a length below a predefined value, deleting a maximal rectangle having a width below a predefined value, and deleting a maximal rectangle having an aspect ratio below a predefined value, the aspect ratio being a longer side length divided by a shorter side length.
 7. The method as claimed in claim 5, wherein, prior to the step of constructing the maximal rectangles, the image is preprocessed by at least one of the following: removing noise by adapting the value of isolated deviant pixels to an average value of pixels in the neighborhood, halftoning by transforming the pixels to either white or black, and reducing the number of pixels by downsampling.
 8. The method as claimed in claim 5, wherein, prior to the step of constructing the maximal rectangles, the image is filtered by detecting foreground separator elements that are objects in the foreground of the image having a pattern of pixel values deviating from said background property, and by replacing pixels of the detected foreground separators by pixels having the background property.
 9. The method as claimed in claim 8, wherein the foreground separator elements include black lines, dashed lines, or dotted lines.
 10. The method as claimed in claim 5, wherein the step of constructing the maximal rectangles comprises: determining a list of maximal runs, a maximal run being a straight line of pixels having the background property, the line having the maximum possible length without including a pixel not having the background property, taking a specific maximal run from the list as rectangle, testing the rectangle if extension is possible by determining for a next maximal run if the next maximal run comprises pixels adjacent to pixels of the rectangle in a width direction, if the extension is possible, extending the rectangle by constructing a new rectangle having the maximum area including pixels of the rectangle and the next maximal run, if no extension is possible, adding the rectangle to the set of maximal rectangles, and eliminating from the list any maximal run that is completely contained in the new rectangle.
 11. The method as claimed in claim 1, wherein the step of constructing the separating elements comprises: processing the image in two orthogonal separation directions.
 12. The method as claimed in claim 1, wherein the step of constructing the separating elements comprises: detecting graphical elements that are objects in the foreground of the image having a pattern of pixel values deviating from said background property, wherein the separating elements are constructed around the graphical elements.
 13. The method as claimed in claim 1, wherein at least one of the fields is classified as text field, a reading order is detected in the text field, and foreground components are joined to text lines in the text field in a direction corresponding to said reading order.
 14. A computer program product embodied on at least one computer readable medium, for segmenting an image of pixels into a number of fields, corresponding to lay-out elements of the image, the pixels having a value representing the intensity and/or color of a picture element, the computer program product comprising computer-executable instructions for: constructing separating elements corresponding to rectangular areas of adjacent pixels of the image having a background property indicative of a background of the image; and constructing a graph representing the lay-out elements of the image by defining vertices of the graph on the basis of intersections of separating elements that are substantially oriented in predetermined separation directions, defining edges of the graph between the vertices corresponding to the separating elements, and defining field separators corresponding to the edges of the graph.
 15. The computer program product as claimed in claim 14, wherein the computer-executable instructions for defining vertices comprise computer-executable instructions for: constructing subsets of the separating elements that are substantially oriented in the predetermined separation directions, and determining the intersections between pairs of separating elements from the subsets.
 16. The computer program product as claimed in claim 14, wherein at least one of the fields is classified as text field, a reading order is detected in the text field, and foreground components are joined to text lines in the text field in a direction corresponding to said reading order.
 17. The computer program as claimed in claim 14, further comprising computer-executable instructions for: constructing a set of maximal rectangles, a maximal rectangle being a rectangular part of the image in one of the separation directions, that has the maximum possible area without including a pixel not having the background property indicative of a background of the image; and constructing the separating elements in a cleaning step wherein at least one pair of overlapping maximal rectangles in the set is replaced by an informative rectangle that is a rectangular part of an area combining the areas of the pair, the rectangular part having the maximum possible length in the relevant separation direction.
 18. A device for segmenting a composite image of pixels into a number of fields corresponding to lay-out elements of the image, the pixels having a value representing the intensity and/or color of a picture element, the device comprising: an input unit for inputting an image; and a processing unit for constructing a graph representing the lay-out elements of the image by constructing separating elements corresponding to rectangular areas of adjacent pixels having a background property indicative of a background of the image, defining vertices of the graph based on intersections of separating elements that are substantially oriented in different separation directions, and defining edges of the graph between the vertices corresponding to the separating elements.
 19. The device as claimed in claim 18, further comprising: a display unit for displaying fields of the image after segmenting.
 20. The device as claimed in claim 18, wherein the processing unit constructs a set of maximal rectangles, a maximal rectangle being a rectangular part of the image in one of the separation directions, that has the maximum possible area without including a pixel not having the background property indicative of a background of the image; and constructs the separating elements in a cleaning step wherein at least one pair of overlapping maximal rectangles in the set is replaced by an informative rectangle that is a rectangular part of an area combining the areas of the pair, the rectangular part having the maximum possible length in the relevant separation direction.
 21. The device as claimed in claim 18, wherein at least one of the fields is classified as text field, a reading order is detected in the text field, and foreground components are joined to text lines in the text field in a direction corresponding to said reading order. 